-
1 Church integer
-
2 Church integer
The New English-Russian Dictionary of Radio-electronics > Church integer
-
3 integer
вчтцелое (число) || целый, целочисленный- binary integer
- Church integer
- coerced integer
- computer integer
- decimal integer
- long integer
- non-negative integer
- short integer
- signed integer
- unsigned integer
- von Neumann integer -
4 integer
вчт.целое (число) || целый, целочисленный- binary integer
- Church integer
- coerced integer
- computer integer
- decimal integer
- long integer
- non-negative integer
- short integer
- signed integer
- unsigned integer
- von Neumann integerThe New English-Russian Dictionary of Radio-electronics > integer
-
5 целое Черча
-
6 целое Черча
-
7 Napier (Neper), John
SUBJECT AREA: Electronics and information technology[br]b. 1550 Merchiston Castle, Edinburgh, Scotlandd. 4 April 1617 Merchiston Castle, Edinburgh, Scotland[br]Scottish mathematician and theological writer noted for his discovery of logarithms, a powerful aid to mathematical calculations.[br]Born into a family of Scottish landowners, at the early age of 13 years Napier went to the University of St Andrews in Fife, but he apparently left before taking his degree. An extreme Protestant, he was active in the struggles with the Roman Catholic Church and in 1594 he dedicated to James VI of Scotland his Plaine Discovery of the Whole Revelation of St John, an attempt to promote the Protestant case in the guise of a learned study. About this time, as well as being involved in the development of military equipment, he devoted much of his time to finding methods of simplifying the tedious calculations involved in astronomy. Eventually he realized that by representing numbers in terms of the power to which a "base" number needed to be raised to produce them, it was possible to perform multiplication and division and to find roots, by the simpler processes of addition, substraction and integer division, respectively.A description of the principle of his "logarithms" (from the Gk. logos, reckoning, and arithmos, number), how he arrived at the idea and how they could be used was published in 1614 under the title Mirifici Logarithmorum Canonis Descriptio. Two years after his death his Mirifici Logarithmorum Canonis Constructio appeared, in which he explained how to calculate the logarithms of numbers and gave tables of them to eight significant figures, a novel feature being the use of the decimal point to distinguish the integral and fractional parts of the logarithm. As originally conceived, Napier's tables of logarithms were calculated using the natural number e(=2.71828…) as the base, not directly, but in effect according to the formula: Naperian logx= 107(log e 107-log e x) so that the original Naperian logarithm of a number decreased as the number increased. However, prior to his death he had readily acceded to a suggestion by Henry Briggs that it would greatly facilitate their use if logarithms were simply defined as the value to which the decimal base 10 needed to be raised to realize the number in question. He was almost certainly also aware of the work of Joost Burgi.No doubt as an extension of his ideas of logarithms, Napier also devised a means of manually performing multiplication and division by means of a system of rods known as Napier's Bones, a forerunner of the modern slide-rule, which evolved as a result of successive developments by Edmund Gunther, William Oughtred and others. Other contributions to mathematics by Napier include important simplifying discoveries in spherical trigonometry. However, his discovery of logarithms was undoubtedly his greatest achievement.[br]BibliographyNapier's "Descriptio" and his "Constructio" were published in English translation as Description of the Marvelous Canon of Logarithms (1857) and W.R.MacDonald's Construction of the Marvelous Canon of Logarithms (1889), which also catalogues all his works. His Rabdologiae, seu Numerationis per Virgulas Libri Duo (1617) was published in English as Divining Rods, or Two Books of Numbering by Means of Rods (1667).Further ReadingD.Stewart and W.Minto, 1787, An Account of the Life Writings and Inventions of John Napier of Merchiston (an early account of Napier's work).C.G.Knott (ed.), 1915, Napier Tercentenary Memorial Volume (the fullest account of Napier's work).KF
См. также в других словарях:
Church encoding — In mathematics, Church encoding is a means of embedding data and operators into the lambda calculus, the most familiar form being the Church numerals, a representation of the natural numbers using lambda notation. The method is named for Alonzo… … Wikipedia
History of the Church-Turing thesis — This article is an extension of the history of the Church Turing thesis.The debate and discovery of the meaning of computation and recursion has been long and contentious. This article provides detail of that debate and discovery from Peano s… … Wikipedia
History of the Church–Turing thesis — This article is an extension of the history of the Church–Turing thesis. The debate and discovery of the meaning of computation and recursion has been long and contentious. This article provides detail of that debate and discovery from Peano s… … Wikipedia
Algorithm — Flow chart of an algorithm (Euclid s algorithm) for calculating the greatest common divisor (g.c.d.) of two numbers a and b in locations named A and B. The algorithm proceeds by successive subtractions in two loops: IF the test B ≤ A yields yes… … Wikipedia
Proof of impossibility — A proof of impossibility, sometimes called a negative proof or negative result , is a proof demonstrating that a particular problem cannot be solved, or cannot be solved in general. Often proofs of impossibility have put to rest decades or… … Wikipedia
Turing machine — For the test of artificial intelligence, see Turing test. For the instrumental rock band, see Turing Machine (band). Turing machine(s) Machina Universal Turing machine Alternating Turing machine Quantum Turing machine Read only Turing machine… … Wikipedia
Function (mathematics) — f(x) redirects here. For the band, see f(x) (band). Graph of example function, In mathematics, a function associates one quantity, the a … Wikipedia
Gödel's incompleteness theorems — In mathematical logic, Gödel s incompleteness theorems, proved by Kurt Gödel in 1931, are two theorems stating inherent limitations of all but the most trivial formal systems for arithmetic of mathematical interest. The theorems are of… … Wikipedia
Turing's proof — First published in January 1937 with the title On Computable Numbers, With an Application to the Entscheidungsproblem , Turing s proof was the second proof of the assertion (Alonzo Church proof was first) that some questions are undecidable :… … Wikipedia
Besondere Zahlen — sind zum einen Zahlen, die im Sinne der Zahlentheorie eine oder mehrere auffällige Eigenschaften besitzen. Außerdem haben viele Zahlen eine besondere Bedeutung in der Mathematik und/oder in Bezug auf die reale Welt. Diese letzteren Zahlen werden… … Deutsch Wikipedia
First-order logic — is a formal logical system used in mathematics, philosophy, linguistics, and computer science. It goes by many names, including: first order predicate calculus, the lower predicate calculus, quantification theory, and predicate logic (a less… … Wikipedia
